Rademacher complexity
#computational_learning_theory
Definition
Let be a bounded set of vectors. The Rademacher average of is
where (Rademacher random variable).
Fix , let be a nonempty set, and suppose class of functions . For any set , let
Fix sample , then the empirical Rademacher complexity of with respect to is
Let be a distribution over , then the Rademacher complexity of size of with respect to is
Notes
- Rademacher complexity can be applied to estimate partition function of an Ising model (Kuck, Sabharwal, Ermon 2018)
See also
References
- J. Shafer, Class Lecture, Topic: "Unit 6: Rademacher Complexity." CS 294-220, UC Berkeley, Spring 2021. https://piazza.com/class_profile/get_resource/khs64r6r5yn154/km1at8uo4o3mk
- C. Scott, Class Lecture, Topic: "10: Rademacher Complexity." EECS 598, University of Michigan, Winter 2014. https://web.eecs.umich.edu/~cscott/past_courses/eecs598w14/notes/10_rademacher.pdf
- https://people.math.binghamton.edu/qiao/math605/book/rademacher-complexity.html
- https://www.cs.cmu.edu/~ninamf/ML11/lect1117.pdf
- J. Kuck, A. Sabharwal, and S. Ermon, βApproximate Inference via Weighted Rademacher Complexity,β Jan. 27, 2018,Β arXiv: arXiv:1801.09028. doi: 10.48550/arXiv.1801.09028.